Multi-Stage Adjustable Robust Mixed-Integer Optimization via Iterative Splitting of the Uncertainty Set
نویسندگان
چکیده
منابع مشابه
Multistage Adjustable Robust Mixed-Integer Optimization via Iterative Splitting of the Uncertainty Set
General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of pri...
متن کاملMulti-target Tracking via Mixed Integer Optimization
Given a set of target detections over several time periods, this paper addresses the multi-target tracking problem (MTT) of optimally assigning detections to targets and estimating the trajectory of the targets over time. MTT has been studied in the literature via predominantly probabilistic methods. In contrast to these approaches, we propose the use of mixed integer optimization (MIO) models ...
متن کاملK-Adaptability in Two-Stage Mixed-Integer Robust Optimization
We study two-stage robust optimization problems with mixed discrete-continuous decisions in both stages. Despite their broad range of applications, these problems pose two fundamental challenges: (i) they constitute infinite-dimensional problems that require a finite-dimensional approximation, and (ii) the presence of discrete recourse decisions typically prohibits dualitybased solution schemes...
متن کاملOn the approximability of adjustable robust convex optimization under uncertainty
In this paper, we consider adjustable robust versions of convex optimization problems with uncertain constraints and objectives and show that under fairly general assumptions, a static robust solution provides a good approximation for these adjustable robust problems. An adjustable robust optimization problem is usually intractable since it requires to compute a solution for all possible realiz...
متن کاملAdjustable Robust Optimization via Fourier-Motzkin Elimination
We demonstrate how adjustable robust optimization (ARO) problems with fixed recourse can be casted as static robust optimization problems via Fourier-Motzkin elimination (FME). Through the lens of FME, we characterize the structures of the optimal decision rules for a broad class of ARO problems. A scheme based on a blending of classical FME and a simple Linear Programming technique that can ef...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2014
ISSN: 1556-5068
DOI: 10.2139/ssrn.2502825